IT University of Copenhagen sitecore@itu.dk https://video.itu.dk en-us Visualplatform http://blogs.law.harvard.edu/tech/rss IT University of Copenhagen Stay up to date with all the things that are happening at IT University of Copenhagen. This podcast will serve you various videos and audios with accounts from scientists and actual students at IT University, and give you a glimpse into their... episodic no https://video.itu.dk/files/rv0.0/sitelogo.gif https://video.itu.dk http://video.itu.dk/photo/74240381/nutan-limaye-computational <p>Nutan Limaye is an associate professor at IT University of Copenhagen and an internationally leading researcher in computational complexity. <p>Nutan’s research focus is on the most prestigious and fundamental questions in computer science, namely: which problems can be solved with limited computational resources? Her recent breakthrough result, with Srinivasan and Tavenas, received the best paper award at the Foundations of Computer Science conference in 2021 and shows that algebraic circuits of constant size require superpolynomial depth.</p> <p>We ask Nutan what these words even mean, and take a deep dive into the foundations of computer science. What are computational problems, computational models, algorithms, and how does one reason scientifically about such broad concepts? In particular, how does an impossibility result even make sense: how can one prove that a problem can never be solved, no matter how many clever ideas we (or anybody else) may have in the future?</p> <p>For more information: <a>thore@itu.dk</a></p></p><p><a href="http://video.itu.dk/photo/74240381/nutan-limaye-computational"><img src="http://video.itu.dk/64968566/74240381/7c087a2e2612a3b641f9d75d891cf784/standard/download-24-thumbnail.jpg" width="75" height=""/></a></p> http://video.itu.dk/photo/74240381 Fri, 18 Feb 2022 10:05:31 GMT Nutan Limaye: Computational complexity Nutan Limaye is an associate professor at IT University of Copenhagen and an internationally leading researcher in computational complexity. Nutan’s research focus is on the most prestigious and fundamental questions in computer science, namely: which problems can be solved with limited computational resources? Her recent breakthrough result, with Srinivasan and Tavenas, received the best paper award at the Foundations of Computer Science conference in 2021 and shows that algebraic circuits of constant size require superpolynomial depth. We ask Nutan what these words even mean, and take a deep dive into the foundations of computer science. What are computational problems, computational models, algorithms, and how does one reason scientifically about such broad concepts? In particular, how does an impossibility result even make sense: how can one prove that a problem can never be solved, no matter how many clever ideas we (or anybody else) may have in the future? For more information: thore@itu.dk Nutan Limaye is an associate professor at IT University of Copenhagen and an internationally leading researcher in computational complexity. Nutan’s research focus is on the most prestigious and fundamental questions in computer science, namely:... IT University of Copenhagen 01:03:44 <p>Nutan Limaye is an associate professor at IT University of Copenhagen and an internationally leading researcher in computational complexity. <p>Nutan’s research focus is on the most prestigious and fundamental questions in computer science, namely: which problems can be solved with limited computational resources? Her recent breakthrough result, with Srinivasan and Tavenas, received the best paper award at the Foundations of Computer Science conference in 2021 and shows that algebraic circuits of constant size require superpolynomial depth.</p> <p>We ask Nutan what these words even mean, and take a deep dive into the foundations of computer science. What are computational problems, computational models, algorithms, and how does one reason scientifically about such broad concepts? In particular, how does an impossibility result even make sense: how can one prove that a problem can never be solved, no matter how many clever ideas we (or anybody else) may have in the future?</p> <p>For more information: <a>thore@itu.dk</a></p></p><p><a href="http://video.itu.dk/photo/74240381/nutan-limaye-computational"><img src="http://video.itu.dk/64968566/74240381/7c087a2e2612a3b641f9d75d891cf784/standard/download-24-thumbnail.jpg" width="75" height=""/></a></p> cast it computational complexity computer science nutan limaye thore husfeldt